Peningkatan Hasil Cluster Menggunakan Algoritma Dynamic K-means dan K-means Binary Search Centroid
نویسندگان
چکیده
منابع مشابه
Scalable Kernel k-Means via Centroid Approximation
Although kernel k-means is central for clustering complex data such as images and texts by implicit feature space embedding, its practicality is limited by the quadratic computational complexity. In this paper, we present a novel technique based on scalable centroid approximation that accelerates kernel k-means down to a sub-quadratic complexity. We prove near-optimality of our algorithm, and e...
متن کاملFaster K-Means Cluster Estimation
K-means is a widely used iterative clustering algorithm. There has been considerable work on improving k-means in terms of mean squared error (MSE) and speed, both. However, most of the k-means variants tend to compute distance of each data point to each cluster centroid for every iteration. We propose two heuristics to overcome this bottleneck and speed up k-means. Our first heuristic predicts...
متن کاملPersistent K-Means: Stable Data Clustering Algorithm Based on K-Means Algorithm
Identifying clusters or clustering is an important aspect of data analysis. It is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. It is a main task of exploratory data mining, and a common technique for statistical data analysis This paper proposed an improved version of K-Means algorithm, namely Persistent K...
متن کاملDistributed K-means over Compressed Binary Data
We consider a network of binary-valued sensors with a fusion center. The fusion center has to perform K-means clustering on the binary data transmitted by the sensors. In order to reduce the amount of data transmitted within the network, the sensors compress their data with a source coding scheme based on LDPC codes. We propose to apply the K-means algorithm directly over the compressed data wi...
متن کاملBinary Images Clustering with K-means
Nowadays, with the large amount of image databases available, there is the need to access them in the most various and easiest ways. For many applications, an expeditious manner to fulfill such need encompasses partitioning images by their content both for indexing or retrieval purposes. In this paper we propose a method to group binary images in respect to their content by means of an unsuperv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Jurnal Tata Kelola dan Kerangka Kerja Teknologi Informasi
سال: 2018
ISSN: 2654-9506,2460-1799
DOI: 10.34010/jtk3ti.v4i1.1395